Analysis of Petri nets with a dynamic priority methodBAUSE, F.Lecture notes in computer science. 1997, pp 215-234, issn 0302-9743, isbn 3-540-63139-9Conference Paper

Reachability is decidable in the numbers gameERIKSSON, K.Theoretical computer science. 1994, Vol 131, Num 2, pp 431-439, issn 0304-3975Article

Reachability of a system described by the multidimensional Roesser modelKUREK, J. E.International Journal of Control. 1987, Vol 45, Num 5, pp 1559-1563, issn 0020-7179Article

Fate and free will in error tracesHOONSANG JIN; RAVI, Kavita; SOMENZI, Fabio et al.International journal on software tools for technology transfer (Print). 2004, Vol 6, Num 2, pp 102-116, issn 1433-2779, 15 p.Conference Paper

Practical tracking with vector settling time and vector reachability timeKOKOSY, A.IFAC international workshop on motion controlAtelier international IFAC sur motion control. 1998, pp 297-302Conference Paper

Left ideals and reachability in machinesHOFER, G.Theoretical computer science. 1989, Vol 68, Num 1, pp 49-56, issn 0304-3975Article

Universal traversal sequences of length nθ(^LOGn) for cliquesKARLOFF, H. J; RAMAMOHAN PATURI; SIMON, J et al.Information processing letters. 1988, Vol 28, Num 9, pp 241-243, issn 0020-0190Article

Comments on «Some results on pole-placement and reachabilitySONTAG, E. D.Systems & control letters. 1986, Vol 8, Num 1, pp 79-83, issn 0167-6911Article

Implication theory and algorithm for reachability matrix modelOHUCHI, A; KURIHARA, M; KAJI, I et al.IEEE transactions on systems, man, and cybernetics. 1986, Vol 16, Num 4, pp 610-616, issn 0018-9472Article

SPeeDI: A verification tool for polygonal hybrid systemsASARIN, Eugene; PACE, Gordon; SCHNEIDER, Gerardo et al.Lecture notes in computer science. 2002, pp 354-358, issn 0302-9743, isbn 3-540-43997-8, 5 p.Conference Paper

prod 3.2: An advanced tool for efficient reachability analysisVARPAANIEMI, K; HELJANKO, K; LILIUS, J et al.Lecture notes in computer science. 1997, pp 472-475, issn 0302-9743, isbn 3-540-63166-6Conference Paper

Controllability in codimension oneGONCALVES, J. B.Journal of differential equations (Print). 1987, Vol 68, Num 1, pp 1-9, issn 0022-0396Article

Lyapunov-like equations and reachability/observability Gramians for descriptor systemsBENDER, D. J.IEEE transactions on automatic control. 1987, Vol 32, Num 4, pp 343-348, issn 0018-9286Article

Infinity of intermediate states is decidable for Petri netsWIMMEL, Harro.Lecture notes in computer science. 2004, pp 426-434, issn 0302-9743, isbn 3-540-22236-7, 9 p.Conference Paper

Dense counter machines and verification problemsGAOYAN XIE; ZHE DANG; IBARRA, Oscar H et al.Lecture notes in computer science. 2003, pp 93-105, issn 0302-9743, isbn 3-540-40524-0, 13 p.Conference Paper

An improved reachability analysis method for strongly linear hybrid systems (extended abstract)BOIGELOT, B; BRONNE, L; RASSART, S et al.Lecture notes in computer science. 1997, pp 167-178, issn 0302-9743, isbn 3-540-63166-6Conference Paper

Validation of protocols with temporal constraintsCACCIARI, L; RAFIQ, O.Computer communications. 1996, Vol 19, Num 14, pp 1188-1199, issn 0140-3664Article

Genericity of open set reachability for some classes of discrete-time nonlinear systemsOLBROT, A; KLEIN, B.IEEE transactions on automatic control. 1986, Vol 31, Num 3, pp 270-271, issn 0018-9286Article

Properties of object Petri netsKÖHLER, Michael; RÖLKE, Heiko.Lecture notes in computer science. 2004, pp 278-297, issn 0302-9743, isbn 3-540-22236-7, 20 p.Conference Paper

Stubborn sets for priority netsVARPAANIEMI, Kimmo.Lecture notes in computer science. 2004, pp 574-583, issn 0302-9743, isbn 3-540-23526-4, 10 p.Conference Paper

An algorithm constructing the semilinear post for 2-dim Reset/Transfer VASSFINKEL, A; SUTRE, G.Lecture notes in computer science. 2000, pp 353-362, issn 0302-9743, isbn 3-540-67901-4Conference Paper

The probability of attaining a structure in a partially stochastic modelGUERRY, M. A.Advances in applied probability. 1993, Vol 25, Num 4, pp 818-824, issn 0001-8678Article

On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topologyMALGOUYRES, Rémy; MORE, Malika.Theoretical computer science. 2002, Vol 283, Num 1, pp 67-108, issn 0304-3975Conference Paper

Periodicity of the profile process in Markov manpower systemsGERONTIDIS, I. I.European journal of operational research. 1995, Vol 85, Num 3, pp 650-669, issn 0377-2217Article

Hybrid Systems in RoboticsDING, Jerry; GILLULA, Jeremy H; HAOMIAO HUANG et al.IEEE robotics & automation magazine. 2011, Vol 18, Num 3, pp 33-43, issn 1070-9932, 11 p.Article